A data locality optimizing algorithm
نویسندگان
چکیده
منابع مشابه
Review of A Data Locality Optimizing Algorithm
What problem did the paper address? Who is the intended audience? The big picture problem is how can we improve program performance given the large latency between the processor and memory. The audience is compiler researchers and writers because they are focusing on an existing compilation technique called tiling, which was developed to avoid memory access latency . The paper addresses the pro...
متن کاملof A Data Locality Optimizing Algorithm
What problem did the paper address? The big picture problem is how can we improve program performance given the large latency between the processor and memory. An approach that has been used in the past is a transformation called tiling. The paper addresses the problem that not all loops are initially tileable. Specifically they answer the question, what combination of loop permutation, skewing...
متن کاملOptimizing Data Locality by Array Restructuring
It is increasingly important that optimizing compilers restructure programs for data locality to obtain high performance on today's powerful architectures. In this paper, we focus on array restructuring , a technique that improves the spatial locality exhibited by array accesses in nested loops. Speci cally, we address the following question: Given a set of such accesses, how should the array e...
متن کاملA Locality Optimizing Algorithm for Developing Stream Programs in Imagine
In this paper, we explore a novel locality optimizing algorithm for developing stream programs in Imagine to sustain high computational ability. Our specific contributions include that we formulate the relationship between streams and kernels as a Data&Computation Matrix (D&C Matrix), and present the key techniques for locality enhancement based on this matrix. The experimental results on five ...
متن کاملA Loop Transformation Algorithm Based on Explicit Data Layout Representation for Optimizing Locality
We present a cache locality optimization technique that can optimize a loop nest even if the arrays referenced have different layouts in memory. Such a capability is required for a global locality optimization framework that applies both loop and data transformations to a sequence of loop nests for optimizing locality. Our method finds a nonsingular iteration-space transformation matrix such th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2004
ISSN: 0362-1340,1558-1160
DOI: 10.1145/989393.989437